Controlling an oscillating Jackson-type network having state-dependent service rates
نویسندگان
چکیده
We consider a Jackson-type network comprised of 2 queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a customers overflow in one of the queues in the network, the server in that same queue contrary to intuition should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is briefly shut down as well, when certain conditions hold.
منابع مشابه
Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...
متن کاملNon-Markovian state dependent networks in critical loading
We establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state dependence. The limit stochastic process is a continuous-path reflected process on the nonnegative orthant. We give an application to generalised Jackson networks with...
متن کاملState Dependent Multi channel Queuing System with Ordered Entry
In the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملOptimal control of service rates and arrivals in Jackson networks
We can represent each dynamic job shop system as a network of queues, in which each service station indicates a machine or a production department. Now, assume that we can control the service rates of these service stations and also the arrival rates to the service stations, in which the arrival rate to each service station corresponds to the total rates of demands for the products which are pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 62 شماره
صفحات -
تاریخ انتشار 2005